Paper derives and analyzes a novel block Fast Fourier Transform (FFT) basedjoint detection algorithm. The paper compares the performance and complexity ofthe novel block-FFT based joint detector to that of the Cholesky based jointdetector and single user detection algorithms. The novel algorithm can operateat chip rate sampling, as well as higher sampling rates, unlike existingalgorithms. For the performance/complexity analysis, the time division duplex(TDD) mode of a wideband code division multiplex access (WCDMA) is considered.The results indicate that the performance of the fast FFT based joint detectoris comparable to that of the Cholesky based joint detector, and much superiorto that of single user detection algorithms. On the other hand, the complexityof the fast FFT based joint detector is significantly lower than that of theCholesky based joint detector and less than that of the single user detectionalgorithms. For the Cholesky based joint detector, the approximate Choleskydecomposition is applied. Moreover, the novel method can also be applied to anygeneric multiple-input-multiple-output (MIMO) system.
展开▼
